Global Constraints in Distributed Constraint Satisfaction and Optimization
نویسندگان
چکیده
Global constraints are an essential component in the efficiency of centralized constraint programming. We propose to include global constraints in distributed constraint satisfaction and optimization problems (DisCSPs and DCOPs). We detail how this inclusion can be done, considering different representations for global constraints (direct, nested, binary). We explore the relation of global constraints with local consistency (both in the hard and soft cases), in particular for generalized arc consistency (GAC). We provide experimental evidence of the benefits of global constraints on several benchmarks, both for distributed constraint satisfaction and for distributed constraint optimization.
منابع مشابه
Distributed Constraint Programming with Agents
Many combinatorial optimization problems lend themselves to be modeled as distributed constraint optimization problems (DisCOP). Problems such as job shop scheduling have an intuitive matching between agents and machines. In distributed constraint problems, agents control variables and are connected via constraints. We have equipped these agents with a full constraint solver. This makes it poss...
متن کاملGlobal constraints in distributed constraint satisfaction
Global constraints have been crucial for the success of centralized constraint programming. Here, we propose the inclusion of global constraints in distributed constraint satisfaction. We show how this inclusion can be done, considering different decompositions for global contraints. We provide experimental evidence of their benefits on several benchmarks solved with the ABT algorithm.
متن کاملLocal Veri cation of Global Integrity Constraints in
We present an optimization for integrity constraint veriication in distributed databases. The optimization allows a global constraint, i.e. a constraint spanning multiple databases, to be veriied by accessing data at a single database, eliminating the cost of accessing remote data. The optimization is based on an algorithm that takes as input a global constraint and data to be inserted into a l...
متن کاملDistributed Optimization for Overconstrained Problems and its Application
Distributed optimization requires the optimization of a global objective function that is distributed among a set of autonomous, communicating agents and is unknown by any individual agent. One major mode of attack has been to treat optimization as an overconstrained distributed satisfaction problem and exploit existing distributed constraint satisfaction techniques. These approaches require in...
متن کاملExploiting Problem Structure for Distributed Constraint Optimization
Distributed constraint optimization imposes considerable complexity in agents’ coordinated search for an optimal solution. However, in many application domains, problems often exhibit special structures that can be exploited to facilitate more efficient problem solving. One of the most recurrent structures involves disparity among subpmblems. We present a coordination mechanism, Anchor&Ascend, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. J.
دوره 57 شماره
صفحات -
تاریخ انتشار 2014